On Mathematical Proofs of the Vacuity of Compositionality
نویسنده
چکیده
There is a widespread feeling among formal semanticists that, with suitable manipulations, any semantics can be made compositional. The following quote is representative: “. . . it [compositionality] being a methodological starting point, it is always possible to satisfy compositionality by simply adjusting the syntactic and/or semantic tools one uses, unless that is, the latter are constrained on independent grounds.” (Groenendijk and Stokhof [4], p. 93). Sometimes this feeling is backed by a mathematical proof, purportedly showing compositionality to be vacuous, or without empirical content. A recent instance is W. Zadrozny’s paper [9] in this journal, where he takes a fact about hypersets (non-wellfounded sets) to show that “. . . any semantics can be encoded as a compositional semantics, which means that, essentially, the standard definition of compositionality is formally vacuous.” (p. 329). In this note I will examine this claim, as well as two earlier ones in the same vein.
منابع مشابه
Right and Wrong Reasons for Compositionality
In this paper I would like to cast a critical look on the potential reasons for compositionality. I will, in particular, evaluate if and to which extent the most often cited reasons in favor of compositionality, viz. productivity, systematicity and inferentiality – each taken as properties of either language or cognition – may be justly regarded as justifications for compositionality. The resul...
متن کاملProbabilistic Noninterference
We formalize a probabilistic noninterference for a multi-threaded language with uniform scheduling, where probabilistic behaviour comes from both the scheduler and the individual threads. We define notions probabilistic noninterference in two variants: resumption-based and trace-based. For the resumption-based notions, we prove compositionality w.r.t. the language constructs and establish sound...
متن کاملSome results on weakly contractive maps
In this paper direct proofs of some common fixed point results for two and three mappings under weak contractive conditions are given. Some of these results are improved by using different arguments of control functions. Examples are presented showing that some generalizations cannot be obtained and also that our results are distinct from the existing ones.
متن کاملPossibilistic Noninterference
We formalize a wide variety of Volpano/Smith-style noninterference notions for a while language with parallel composition. We systematize and classify these notions according to compositionality w.r.t. the language constructs. Compositionality yields sound syntactic criteria (a.k.a. type systems) in a uniform way.
متن کاملOn certain maximality principles
We present streamlined proofs of certain maximality principles studied by Hamkins and Woodin. Moreover, we formulate an intermediate maximality principle, which is shown here to be equiconsistent with the existence of a weakly compact cardinal $kappa$ such that $V_{kappa}prec V$.
متن کامل